Maximum Degree Energy of Certain Mesh Derived Networks
نویسندگان
چکیده
منابع مشابه
On Laplacian Energy of Certain Mesh Derived Networks
Eigenvalues of a graph are the eigenvalues of its adjacency matrix. The multiset of eigenvalues is called its spectrum. There are many properties which can be explained using the spectrum like energy, connectedness, vertex connectivity, chromatic number, perfect matching etc. Laplacian spectrum is the multiset of eigenvalues of Laplacian matrix. The Laplacian energy of a graph is the sum of the...
متن کاملThe Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree ∆ and the diameter D, was introduced in [1], as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide s...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملBluetooth Low Energy Mesh Networks: A Survey
Bluetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/13513-1289